Theoretical Relations Between Domain Decomposition and Dynamic Substructuring

نویسنده

  • Daniel J. Rixen
چکیده

Domain decomposition methods used for solving linear systems are strongly related to dynamic substructuring methods commonly used to build a reduced model. In this study we investigate some theoretical relations between the methods. In particular we discuss the conceptual similarities between the Schur Complement solvers and the Craig-Bampton substructuring techniques, both for their primal and dual form.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Iterative Substructuring Algorithm for Problems in Three Dimensions

In domain decomposition algorithms with more than a few subdomains, there is a crucial need for a mechanism to provide for global communication of information at each step of the iterative process. The convergence rate will decay rapidly with an increasing number of subdomains if communication is only between neighboring subdomains. For iterative substructuring algorithms (those domain decompos...

متن کامل

An adapted coarse space for Balancing domain decomposition method to solve nonlinear elastodynamic problems

This work is devoted to present a scalable domain decomposition method to solve nonlinear elastodynamic problems. Large non linear elastodynamic problems represent an appropriate application field for substructuring methods which are efficient on parallel computer with the proviso of using specific preconditioner techniques well adapted to the mechanical modeling. According to this reason, we d...

متن کامل

A Parallel Implementation of an Iterative Substructuring Algorithm for Problems in Three Dimensions

Numerical results from a parallel implementation of an iterative substructuring algorithm are reported. The algorithm is for solving scalar, self-adjoint elliptic partial diierential equations in three dimensions. Results are given for two variants of the algorithm. In the rst variant, exact interior solvers are used; in the second, one multigrid V-cycle is used to approximately solve the inter...

متن کامل

Monolithic and Partitioned L-stable Rosenbrock Methods for Dynamic Substructure Tests

Real-time testing with dynamic substructuring is a hybrid numerical-experimental technique, the challenge of which is to ensure that both numerical and physical substructures interact in realtime, in order to simulate the behaviour of an emulated structure. With this objective in mind, the development and implementation of partitioned real-time compatible Rosenbrock algorithms are presented in ...

متن کامل

Convergence of a balancing domain decomposition by constraints and energy minimization

A convergence theory is presented for a substructuring preconditioner based on constrained energy minimization concepts. The preconditioner is formulated as an Additive Schwarz method and analyzed by building on existing results for Balancing Domain Decomposition. The main result is a bound on the condition number based on inequalities involving the matrices of the preconditioner. Estimates of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004